Redundancy in Logic II: 2CNF and Horn Propositional Formulae
نویسنده
چکیده
We report complexity results about redundancy of formulae in 2CNF form. We first consider the problem of checking redundancy and show some algorithms that are slightly better than the trivial one. We then analyze problems related to finding irredundant equivalent subsets (i.e.s.) of a given set. The concept of cyclicity proved to be relevant to the complexity of these problems. Some results about Horn formulae are also shown.
منابع مشابه
Language Splitting and Relevance-Based Belief Change in Horn Logic
This paper presents a framework for relevance-based belief change in propositional Horn logic. We firstly establish a parallel interpolation theorem for Horn logic and show that Parikh’s Finest Splitting Theorem holds with Horn formulae. By reformulating Parikh’s relevance criterion in the setting of Horn belief change, we construct a relevance-based partial meet Horn contraction operator and p...
متن کاملPseudo-models and propositional Horn inference
A well known result is that the inference problem for propositional Horn formulae can be solved in linear time. We show that this remains true even in the presence of arbitrary (static) propositional background knowledge. Our main tool is the notion of a cumulated clause, a slight generalization of the usual clauses in Propositional Logic. We show that each propositional theory has a canonical ...
متن کاملA New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degree of belief and reasoning in Bayesian networks, are computationally equivalent to model counting. It has been shown that model counting in even the most restrictive logics, such as Horn logic, monotone CNF and 2CNF, ...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملHorn renamability and hypergraphs
The satisfiability problem, SAT, consisting of testing the satisfiability of a propositional formula, is known to be NP-complete. On the other hand, several subclasses of propositional formulae are known, so that the restriction of SAT to such a subclass is solvable in polynomial time [7, 2] — among them Horn formulae [5] and formulae that are reducible toHorn, such as Horn-renamable formulae [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 172 شماره
صفحات -
تاریخ انتشار 2008